Alpha shape and Delaunay triangulation in studies of protein-related interactions
نویسندگان
چکیده
منابع مشابه
Alpha shape and Delaunay triangulation in studies of protein-related interactions
In recent years, more 3D protein structures have become available, which has made the analysis of large molecular structures much easier. There is a strong demand for geometric models for the study of protein-related interactions. Alpha shape and Delaunay triangulation are powerful tools to represent protein structures and have advantages in characterizing the surface curvature and atom contact...
متن کاملDelaunay Triangulation of Manifolds
We present an algorithmic framework for producing Delaunay triangulations of manifolds. The input to the algorithm is a set of sample points together with coordinate patches indexed by those points. The transition functions between nearby coordinate patches are required to be bi-Lipschitz with a constant close to 1. The primary novelty of the framework is that it can accommodate abstract manifo...
متن کاملComputation of Tunnels in Protein Molecules using Delaunay Triangulation
This paper presents a new method of specific cavity analysis in protein molecules. Long-term biochemical research has the discovery that protein molecule behaviour depends on the existence of cavities (tunnels) leading from the inside of the molecule to its surface. Previous methods of tunnel computation were based on space rasterization. Our approach is based on computational geometry and uses...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملHexagonal Delaunay Triangulation
We present a novel and robust algorithm for triangulating point clouds in R. It is based on a highly adaptive hexagonal subdivision scheme of the input domain. That hexagon mesh has a dual triangular mesh with the following properties: • any angle of any triangle lies in the range between 43.9◦ and 90◦, • the aspect ratio of triangles is bound to 1.20787, • the triangulation has the Delaunay pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Briefings in Bioinformatics
سال: 2012
ISSN: 1467-5463,1477-4054
DOI: 10.1093/bib/bbs077